Values of linear recurring sequences of vectors over finite fields

نویسندگان

  • Gary L. Mullen
  • Igor Shparlinski
  • I. Shparlinski
چکیده

(1) s(k) = { vk if k ≤ n , ∑n−1 i=0 ais(k − n+ i) if k > n . We note that the elements of the sequence S can be considered as elements of the field Fqn which is an n-dimensional vector space over Fq. It is easy to see that without loss of generality we can suppose that f(0) 6= 0. Thus, it is possible to define the order of f , denoted by τ , as the least positive integer t for which f(x) divides x − 1. It is known from [4] that the period of the sequence S does not exceed τ . For other details concerning polynomials and linear recurring sequence over Fq, see [4]. In this paper we improve and generalize some results from the papers [1], [2], [6], [7] which are also devoted to studying the distribution of values of linear recurring sequences over finite fields. For some applications of such sequences see [1], [2]. It is easy to check that if α, μ ∈ Fqn then for any fixed basis of Fqn over Fq, the coordinate-vectors {ck} of the powers αμ, k = 1, 2, . . . , satisfy such

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear complexity over Fq and over Fqm for linear recurring sequences

Article history: Received 7 August 2008 Revised 25 September 2008 Communicated by Gary L. Mullen

متن کامل

Matrices and Linear Recurrences in Finite Fields

Linear recurring sequences of order k are investigated using matrix techniques and some finite group theory. An identity, well-known when k = 2, is extended to general k and is used to study the restricted period of a linear recurring sequence over a finite field.

متن کامل

Quasi-cyclic codes as codes over rings of matrices

Quasi cyclic codes over a finite field are viewed as cyclic codes over a non commutative ring of matrices over a finite field. This point of view permits to generalize some known results about linear recurring sequences and to propose a new construction of some quasi cyclic codes and self dual codes.

متن کامل

Classical Wavelet Transforms over Finite Fields

This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...

متن کامل

Classical wavelet systems over finite fields

This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006